Abstraction Refinement for Pushdown Systems

نویسندگان

  • Stefan Kiefer
  • Javier Esparza
چکیده

ion Refinement for Pushdown Systems

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems

ion Refinement with Craig Interpolation and Symbolic Pushdown Systems ? Javier Esparza, Stefan Kiefer, and Stefan Schwoon Institute for Formal Methods in Computer Science, University of Stuttgart {esparza,kiefersn,schwoosn}@informatik.uni-stuttgart.de Abstract. Counterexample-guided abstraction refinement (CEGAR) has proven to be a powerful method for software model-checking. In this paper, we ...

متن کامل

Terminator: Beyond Safety

Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checking and iterative counterexample-guided abstraction refinement, etc.) are restricted to safety properties. Terminator is the first software model checker for termination. It is now being used to prove that device driver dispatch routines always return to their caller (or r...

متن کامل

Verifying Concurrent Message-Passing C Programs with Recursive Calls

We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce the reachability problem for this model to deciding the emptiness of the intersection of two context-free la...

متن کامل

Improving Communicating Pushdown System Model Checking

Communicating pushdown systems (CPDSs) are a formalism for modeling the behaviors of concurrent systems. They have been used to model concurrent C and Java programs. Once a concurrent program has been modeled as a CPDS, a reachability query is given to a CPDS model checker to determine if the property of interest is satisfied by the program model. Our CPDS model checker implements a semi-decisi...

متن کامل

Verifying Parametric Thread Creation

Automatic verification of concurrent systems is an active area of research since at least a quater of a century. We focus here on analyses of systems designed to operate with an arbitrary number of processes. German and Sistla, already in 1992, initiated in depth investigation of this problem for finite state systems. For infinite state systems, like pushdown systems, extra care is needed to av...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005